Fast Arithmetical Algorithms in Möbius Number Systems
نویسنده
چکیده
We analyze the time complexity of exact real arithmetical algorithms in Möbius number systems. Using the methods of Ergodic theory, we associate to any Möbius number system its transaction quotient T and show that the norm of the state matrix after n transactions is of the order T . We argue that the Bimodular Möbius number system introduced in Kůrka [10] has transaction quotient less than 1.1, so that it computes the arithmetical operations faster than the standard positional r-ary systems.
منابع مشابه
Exact real arithmetic for interval number systems
An interval number system is given by an initial interval cover of the extended real line and by a finite system of nonnegative Möbius transformations. Each sequence of transformations applied to an initial interval determines a sequence of nested intervals whose intersection contains a unique real number. We adapt in this setting exact real algorithms which compute arithmetical operations to a...
متن کاملCharacterizations of Lambek-carlitz Type
We give Lambek-Carlitz type characterization for completely multiplicative reduced incidence functions in Möbius categories of full bi-nomial type. The q-analog of the Lambek-Carlitz type characterization of exponential series is also established. 1. An arithmetical function f is called multiplicative if (1.1) f (mn) = f (m)f (n) whenever (m, n) = 1 and it is called completely multiplicative if...
متن کاملFast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems
We give an O∗(2k)-time algorithm for STEINER TREE using polynomial space, where k is the number of terminals. To obtain this result, we apply Möbius inversion, also known as Inclusion-Exclusion, to the famous Dreyfus-Wagner recurrence. Among our results are also polynomial-space O∗(2n) algorithms for several NP-complete spanning tree and partition problems. With these results, we solve open pro...
متن کاملQuasi-Affine Transformation in Higher Dimension
In many applications and in many fields, algorithms can considerably be speed up if the underlying arithmetical computations are considered carefully. In this article, we present a theoretical analysis of discrete affine transformations in higher dimension. More precisely, we investigate the arithmetical paving structure induced by the transformation to design fast algorithms.
متن کاملConvergence in Möbius Number Systems
The Möbius number systems use sequences of Möbius transformations to represent the extended real line or, equivalently, the unit complex circle. An infinite sequence of Möbius transformations represents a point x on the circle if and only if the transformations, in the limit, take the uniform measure on the circle to the Dirac measure centered at the point x. We present new characterizations of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Computers
دوره 61 شماره
صفحات -
تاریخ انتشار 2012